#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
	int n;
	cin >> n;
	vector<ll> a(n);
	ll mx = LLONG_MIN;
	map<int, int> mp;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		mx = max(mx, a[i]);
		mp[a[i]]++;
	}
	int cnt = mp[mx];
	if (mx >= cnt) {
		cout << "red" << endl;
	} else {
		cout << "purple" << endl;
	}

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t;
	cin >> t;
	while (t-- > 0) solve();
	return 0;
}